Efficient algorithms to solve singular integral equations of Abel type
نویسندگان
چکیده
منابع مشابه
NUMERICAL APPROACH TO SOLVE SINGULAR INTEGRAL EQUATIONS USING BPFS AND TAYLOR SERIES EXPANSION
In this paper, we give a numerical approach for approximating the solution of second kind Volterra integral equation with Logarithmic kernel using Block Pulse Functions (BPFs) and Taylor series expansion. Also, error analysis shows efficiency and applicability of the presented method. Finally, some numerical examples with exact solution are given.
متن کاملNew Stable Numerical Solutions of Singular Integral Equations of Abel Type by Using Normalized Bernstein Polynomials
A new numerical method, based on the normalized Bernstein polynomials for solving singular integral equations of Abel type is presented here in this paper. We construct an othonormal family { } i n i b 0 = of polynomials of degree n from the th n degree Bernstein polynomials n i B and use them as a basis to approximate the known and unknown functions ) (x f and ) (x φ respectively in the Abel’s...
متن کاملModified homotopy method to solve non-linear integral equations
In this article we decide to define a modified homotopy perturbation for solving non-linear integral equations. Almost, all of the papers that was presented to solve non-linear problems by the homotopy method, they used from two non-linear and linear operators. But we convert a non-linear problem to two suitable non-linear operators also we use from appropriate bases functions such as Legendre ...
متن کاملAn effective method for approximating the solution of singular integral equations with Cauchy kernel type
In present paper, a numerical approach for solving Cauchy type singular integral equations is discussed. Lagrange interpolation with Gauss Legendre quadrature nodes and Taylor series expansion are utilized to reduce the computation of integral equations into some algebraic equations. Finally, five examples with exact solution are given to show efficiency and applicability of the method. Also, w...
متن کاملCG-type algorithms to solve symmetric matrix equations
The global FOM and GMRES are among the effective algorithms to solve linear system of equations with multiple right-hand sides. In this paper, we study these algorithms in the case that the coefficient matrix is symmetric and extract two CGtype algorithms for solving symmetric linear systems of equations with multiple right– hand sides. Then, we compare the numerical performance of the new algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2009
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2008.10.085